Inclusive and Exclusive or Interpretation for Indefinite Deductive Databases

Indefinite and GCWA Inference in Indefinite Deductive Databases

This paper presents several basic results on compiling indefinite and GCWA(Generalized Closed World Assumption) inference in IDDB(Indefinite Dedutive Databases). We do not allow function symbols, but do allow non-Horn clauses. Further, although the GCWA is used to derive negative assumptions, we do also allow negative clauses to occur explicitly. We show a fundamental relationship between indef...

Intuitionistic Interpretation of Deductive Databases with Incomplete Information

Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...

Coping with Indefinite and Negative Data in Deductive Databases: A Survey

[Jo93a] C. A. Johnson, Top down deduction in indefinite deductive databases, Keele University technical report (TR93-08).

Family practice: exclusive, inclusive, or--heaven forbid--both?

Prolog and deductive databases

The logic programming language Prolog has been shown to be a very suitable language for implementing database concepts. However, current Prolog implementations are limited, and the database examples used have all consisted of relatively small sets of clauses. The reason for this is that existing Prolog implementations do not scale up to handle large databases. This paper describes a project who...